The logic of backward induction
نویسندگان
چکیده
The logic of backward induction (BI) in perfect information (PI) games has been intensely scrutinized for the past quarter century. A major development came in 2002, when P. Battigalli and M. Sinischalchi (BS) showed that an outcome of a PI game is consistent with common strong belief of utility maximization if and only if it is the BI outcome. Both BS’s formulation, and their proof, are complex and deep. We show that the result continues to hold when utility maximization is replaced by a rationality condition that is even more compelling; more important, the formulation and proof become far more transparent, accessible, and self-contained.
منابع مشابه
Fuzzy Logic Based Life Estimation of PWM Driven Induction Motors
Pulse-width modulated (PWM) adjustable frequency drives (AFDs) are extensively used in industries for control of induction motors. It has led to significant advantages in terms of the performance, size, and efficiency but the output voltage waveform no longer remains sinusoidal. Hence, overshoots, high rate of rise, harmonics and transients are observed in the voltage wave. They increase voltag...
متن کاملTR-2009011: Knowledge-Based Rational Decisions
We outline a mathematical model of rational decision-making based on standard game-theoretical assumptions: 1) rationality yields a payoff maximization given the player’s knowledge; 2) the standard logic of knowledge for Game Theory is the modal logic S5. Within this model, each game has a solution and rational players know which moves to make at each node. We demonstrate that uncertainty in ga...
متن کاملKnowledge-Based Rational Decisions
We outline a mathematical model of rational decision-making based on standard game-theoretical assumptions: 1) rationality yields a payoff maximization given the player’s knowledge; 2) the standard logic of knowledge for Game Theory is the modal logic S5. Within this model, each game has a solution and rational players know which moves to make at each node. We demonstrate that uncertainty in ga...
متن کاملVerification of Logic Programs and Imperative Programs
This paper explores the relationship between veriication of logic programs and imperative programs with the aim of uncovering the kinds of reasoning used to construct logic programs. We discuss forward reasoning, such as that used for verifying imperative programs using the inductive assertion method, and backward reasoning, such as that used for verifying imperative programs using subgoal indu...
متن کاملPublic Announcement Logic in Geometric Frameworks
In this paper, we introduce public announcement logic in different geometric frameworks. First, we consider topological models, and then extend our discussion to a more expressive model, namely, subset spacemodels. Furthermore,we prove the completeness of public announcement logic in those frameworks. After that, we apply our results to different issues: announcement stabilization, backward ind...
متن کاملPOWERSET OPERATOR FOUNDATIONS FOR CATALG FUZZY SET THEORIES
The paper sets forth in detail categorically-algebraic or catalg foundations for the operations of taking the image and preimage of (fuzzy) sets called forward and backward powerset operators. Motivated by an open question of S. E. Rodabaugh, we construct a monad on the category of sets, the algebras of which generate the fixed-basis forward powerset operator of L. A. Zadeh. On the next step, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Economic Theory
دوره 159 شماره
صفحات -
تاریخ انتشار 2015